Multiproduct Systems with Both Setup Times and Costs: Fluid Bounds and Schedules

نویسندگان

  • Wei-Min Lan
  • Tava Lennon Olsen
چکیده

This paper considers a multi-product, single-server production system where both setup times and costs are incurred whenever the server changes product. The system is make-to-order with a per unit backlogging cost. The objective is to minimize the long-run average cost per unit time. Using a fluid model, we provide a closed-form lower bound on system performance. This bound is also shown to provide a lower bound for stochastic systems when scheduling is static, but is only an approximation when scheduling is dynamic. Heavy-traffic analysis yields a refined bound that includes second-moment terms. The fluid bound suggests both dynamic and static scheduling heuristics, which are tested via a simulation study.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Campaign Planning and Scheduling for Multiproduct Batch Operations with Applications to the Food-Processing Industry

W analyze planning and scheduling of multiproduct batch operations in the food-processing industry. Such operations are encountered in many applications including manufacturing of sorbitol, modified starches, and specialty sugars. Unlike discrete manufacturing, batch sizes in these operations cannot be set arbitrarily, but are often determined by equipment size. Multiple batches of the same pro...

متن کامل

Budgetary Constraints and Idle Time Allocation in Common-Cycle Production with non-zero Setup Time

Economic lot size scheduling problem (ELSP) for a multi-product single machine system is a classical problem. This paper considers ELSP with budgetary constraint as an important aspect of such systems. In the real world situations the available funds for investment in inventory is limited. By adopting the common cycle time approach to ELSP, we obtain the optimal common cycle which minimizes the...

متن کامل

Minimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times

The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...

متن کامل

Simultaneous Lot Sizing and Scheduling in a Flexible Flow Line

This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...

متن کامل

Two-stage fuzzy-stochastic programming for parallel machine scheduling problem with machine deterioration and operator learning effect

This paper deals with the determination of machine numbers and production schedules in manufacturing environments. In this line, a two-stage fuzzy stochastic programming model is discussed with fuzzy processing times where both deterioration and learning effects are evaluated simultaneously. The first stage focuses on the type and number of machines in order to minimize the total costs associat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Operations Research

دوره 54  شماره 

صفحات  -

تاریخ انتشار 2006